Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Algorithme glouton")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1342

  • Page / 54
Export

Selection :

  • and

Structural properties of greedoidsKORTE, B; LOVASZ, L.Combinatorica (Print). 1983, Vol 3, Num 3-4, pp 359-374, issn 0209-9683Article

Greedoids and linear objective functionsKORTE, B; LOVASZ, L.SIAM journal on algebraic and discrete methods. 1984, Vol 5, Num 2, pp 229-238, issn 0196-5212Article

Totally-balanced and greedy matricesHOFFMAN, A. J; KOLEN, A. W. J; SAKAROVITCH, M et al.SIAM journal on algebraic and discrete methods. 1985, Vol 6, Num 4, pp 721-730, issn 0196-5212Article

A Greedy algorithm for solving a class of convex programming problems and its connect on with polymatroid theoryMORTON, G; VON RANDOW, R; RINGWALD, K et al.Mathematical programming. 1985, Vol 32, Num 2, pp 238-241, issn 0025-5610Article

On incremental computation of transitive closure and greedy alignmentABDEDDAÏM, S.Lecture notes in computer science. 1997, pp 167-179, issn 0302-9743, isbn 3-540-63220-4Conference Paper

Δ-Matroids with the strong exchange conditionsWENZEL, W.Applied mathematics letters. 1993, Vol 6, Num 5, pp 67-70, issn 0893-9659Article

Nested optimal policies for set functions with applications to schedulingASSAD, A. A.Mathematics of operations research. 1985, Vol 10, Num 1, pp 82-99, issn 0364-765XArticle

Quasi-greedy triangulations approximating the minimum weight triangulationLEVCOPOULOS, C; KRZNARIC, D.Journal of algorithms (Print). 1998, Vol 27, Num 2, pp 303-338, issn 0196-6774Conference Paper

Matchings and Δ-matroids with coefficientsKALHOFF, F; WENZEL, W.Advances in applied mathematics (Print). 1996, Vol 17, Num 1, pp 63-87, issn 0196-8858Article

Further results on T-coloring and frequency assignment problemsARUNDHATI RAYCHAUDHURI.SIAM journal on discrete mathematics (Print). 1994, Vol 7, Num 4, pp 605-613, issn 0895-4801Article

The partial order of a polymatroid extreme pointBIXBY, R. E; CUNNINGHAM, W. H; TOPKIS, D. M et al.Mathematics of operations research. 1985, Vol 10, Num 3, pp 367-378, issn 0364-765XArticle

ON THE GREEDY HEURISTIC FOR CONTINUOUS COVERING AND PACKING PROBLEMSFISHER ML; WOLSEY LA.1982; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1982; VOL. 3; NO 4; PP. 584-591; BIBL. 10 REF.Conference Paper

AN ANALYSIS OF THE GREEDY ALGORITHM FOR THE SUBMODULAR SET COVERING PROBLEMWOLSEY LA.1982; COMBINATORICA (BUDAPEST. 1981); ISSN 0209-9683; HUN; DA. 1982; VOL. 2; NO 4; PP. 385-393; BIBL. 10 REF.Article

AN ANALYSIS OF THE GREEDY ALGORITHM FOR PARTIALLY ORDERED SETSCROITORU C.1982; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1982; VOL. 4; NO 2; PP. 113-117; BIBL. 6 REF.Article

Guarantees for the success frequency of an algorithm for finding dodgson-election winnersHOMAN, Christopher M; HEMASPAANDRA, Lane A.Lecture notes in computer science. 2006, pp 528-539, issn 0302-9743, isbn 3-540-37791-3, 1Vol, 12 p.Conference Paper

A tight analysis of the greedy algorithm for set coverSLAVIK, P.Journal of algorithms (Print). 1997, Vol 25, Num 2, pp 237-254, issn 0196-6774Article

Fuzzy matroid sums and a greedy algorithmGOETSCHEL, R. JR; VOXMAN, W.Fuzzy sets and systems. 1992, Vol 52, Num 2, pp 189-200, issn 0165-0114Article

On ordered languages and the optimization of linear functions by Greedy algorithmsFAIGLE, U.Journal of the Association for Computing Machinery. 1985, Vol 32, Num 4, pp 861-870, issn 0004-5411Article

New results on the k-Truck ProblemWEIMIN MA; YINFENG XU; YOU, Jane et al.Lecture notes in computer science. 2002, pp 504-513, issn 0302-9743, isbn 3-540-43996-X, 10 p.Conference Paper

Improved performance of the greedy algorithm for partial coverSLAVIK, P.Information processing letters. 1997, Vol 64, Num 5, pp 251-254, issn 0020-0190Article

Adaptive time-frequency decompositionsDAVIS, G; MAILAT, S; ZHIFENG ZHANG et al.Optical engineering (Bellingham. Print). 1994, Vol 33, Num 7, pp 2183-2191, issn 0091-3286Article

Greedy algorithm compatibility and heavy-set structuresBRYANT, V; BROOKSBANK, P.European journal of combinatorics. 1992, Vol 13, Num 2, pp 81-86, issn 0195-6698Article

Optimizing the measurement processing order for linear regressionROBERTAZZI, T. G; SCHWARTZ, S. C.Journal of statistical computation and simulation (Print). 1988, Vol 30, Num 4, pp 233-258, issn 0094-9655Article

A Monge property for the d-dimensional transportation problemBEIN, W. W; BRUCKER, P; PARK, J. K et al.Discrete applied mathematics. 1995, Vol 58, Num 2, pp 97-109, issn 0166-218XConference Paper

On the geometric structure of independence systemsCONFORTI, M; LAURENT, M.Mathematical programming. 1989, Vol 45, Num 2, pp 255-277, issn 0025-5610, 23 p.Article

  • Page / 54